0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E %s %d THM
0.12/0.33	% Computer : n001.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 07:02:24 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p
0.20/0.50	# Version: 3.2.0-ho
0.20/0.50	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_9 with 900s (5) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# Starting sh1l with 180s (1) cores
0.20/0.50	# Starting post_as_ho10 with 180s (1) cores
0.20/0.50	# post_as_ho10 with pid 10369 completed with status 0
0.20/0.50	# Result found by post_as_ho10
0.20/0.50	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_9 with 900s (5) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# Starting sh1l with 180s (1) cores
0.20/0.50	# Starting post_as_ho10 with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGHNF-FFSS00-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# new_ho_10 with pid 10374 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_9 with 900s (5) cores
0.20/0.50	# Starting post_as_ho1 with 180s (1) cores
0.20/0.50	# Starting sh1l with 180s (1) cores
0.20/0.50	# Starting post_as_ho10 with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGHNF-FFSS00-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_23, type, inv: ($i > $i > $o) > $i > $i > $o).
0.20/0.50	thf(decl_32, type, asymm: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_34, type, trans: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_39, type, so: ($i > $i > $o) > $o).
0.20/0.50	thf(decl_51, type, epred1_0: $i > $i > $o).
0.20/0.50	thf(decl_52, type, esk1_0: $i).
0.20/0.50	thf(decl_53, type, esk2_0: $i).
0.20/0.50	thf(decl_54, type, esk3_0: $i).
0.20/0.50	thf(decl_55, type, esk4_0: $i).
0.20/0.50	thf(decl_56, type, esk5_0: $i).
0.20/0.50	thf(strict_order, axiom, ((so)=(^[X1:$i > $i > $o]:(((asymm @ X1)&(trans @ X1))))), file('/export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p', strict_order)).
0.20/0.50	thf(asymmetric, axiom, ((asymm)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i]:(((X1 @ X3 @ X4)=>~((X1 @ X4 @ X3))))))), file('/export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p', asymmetric)).
0.20/0.50	thf(transitive, axiom, ((trans)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X6))=>(X1 @ X3 @ X6)))))), file('/export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p', transitive)).
0.20/0.50	thf(inverse, axiom, ((inv)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:((X1 @ X4 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p', inverse)).
0.20/0.50	thf(inverse_of_strict_order_is_strict_order, conjecture, ![X1:$i > $i > $o]:(((so @ X1)=>(so @ (inv @ X1)))), file('/export/starexec/sandbox/tmp/tmp.tIwneD9r3P/E---3.1_10286.p', inverse_of_strict_order_is_strict_order)).
0.20/0.50	thf(c_0_5, plain, ((so)=(^[Z0/* 8 */:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(fof_simplification,[status(thm)],[strict_order])).
0.20/0.50	thf(c_0_6, plain, ((asymm)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i]:(((Z0 @ X3 @ X4)=>~((Z0 @ X4 @ X3))))))), inference(fof_simplification,[status(thm)],[asymmetric])).
0.20/0.50	thf(c_0_7, plain, ((trans)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((Z0 @ X3 @ X4)&(Z0 @ X4 @ X6))=>(Z0 @ X3 @ X6)))))), inference(fof_simplification,[status(thm)],[transitive])).
0.20/0.50	thf(c_0_8, plain, ((inv)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:((Z0 @ Z2 @ Z1)))), inference(fof_simplification,[status(thm)],[inverse])).
0.20/0.50	thf(c_0_9, plain, ((so)=(^[Z0/* 8 */:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.20/0.50	thf(c_0_10, negated_conjecture, ~(![X1:$i > $i > $o]:(((![X158:$i, X159:$i]:(((X1 @ X158 @ X159)=>~((X1 @ X159 @ X158))))&![X160:$i, X161:$i, X162:$i]:((((X1 @ X160 @ X161)&(X1 @ X161 @ X162))=>(X1 @ X160 @ X162))))=>(![X163:$i, X164:$i]:(((X1 @ X164 @ X163)=>~((X1 @ X163 @ X164))))&![X165:$i, X166:$i, X167:$i]:((((X1 @ X166 @ X165)&(X1 @ X167 @ X166))=>(X1 @ X167 @ X165))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[inverse_of_strict_order_is_strict_order]), c_0_8]), c_0_9])).
0.20/0.50	thf(c_0_11, negated_conjecture, ![X169:$i, X170:$i, X171:$i, X172:$i, X173:$i]:((((~(epred1_0 @ X169 @ X170)|~(epred1_0 @ X170 @ X169))&(~(epred1_0 @ X171 @ X172)|~(epred1_0 @ X172 @ X173)|(epred1_0 @ X171 @ X173)))&(((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)))&((((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0))&((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)))&(~(epred1_0 @ esk5_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])).
0.20/0.50	thf(c_0_12, negated_conjecture, ![X3:$i, X4:$i, X6:$i]:(((epred1_0 @ X3 @ X6)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_13, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_14, negated_conjecture, ![X3:$i]:(((epred1_0 @ esk1_0 @ esk2_0)|(epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.20/0.50	thf(c_0_15, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_16, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_17, negated_conjecture, ![X4:$i, X3:$i]:((~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_18, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
0.20/0.50	thf(c_0_19, negated_conjecture, ((epred1_0 @ esk4_0 @ esk3_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_20, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.20/0.50	thf(c_0_21, negated_conjecture, (epred1_0 @ esk4_0 @ esk3_0), inference(sr,[status(thm)],[c_0_19, c_0_20])).
0.20/0.50	thf(c_0_22, negated_conjecture, ((epred1_0 @ esk5_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_23, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|~((epred1_0 @ esk5_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_24, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_12, c_0_21])).
0.20/0.50	thf(c_0_25, negated_conjecture, (epred1_0 @ esk5_0 @ esk4_0), inference(sr,[status(thm)],[c_0_22, c_0_20])).
0.20/0.50	thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])]), c_0_20]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 59
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 37
0.20/0.50	# Removed in clause preprocessing      : 29
0.20/0.50	# Initial clauses in saturation        : 8
0.20/0.50	# Processed clauses                    : 31
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 31
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 3
0.20/0.50	# Backward-rewritten                   : 7
0.20/0.50	# Generated clauses                    : 21
0.20/0.50	# ...of the previous two non-redundant : 18
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 1
0.20/0.50	# Paramodulations                      : 19
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 8
0.20/0.50	# ...of those cached                   : 6
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 11
0.20/0.50	#    Positive orientable unit clauses  : 3
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 3
0.20/0.50	#    Non-unit-clauses                  : 5
0.20/0.50	# Current number of unprocessed clauses: 3
0.20/0.50	# ...number of literals in the above   : 8
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 20
0.20/0.50	# Clause-clause subsumption calls (NU) : 83
0.20/0.50	# Rec. Clause-clause subsumption calls : 77
0.20/0.50	# Non-unit clause-clause subsumptions  : 2
0.20/0.50	# Unit Clause-clause subsumption calls : 15
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 1
0.20/0.50	# BW rewrite match successes           : 1
0.20/0.50	# Condensation attempts                : 31
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 3563
0.20/0.50	# Search garbage collected termcells   : 913
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.005 s
0.20/0.50	# System time              : 0.004 s
0.20/0.50	# Total time               : 0.009 s
0.20/0.50	# Maximum resident set size: 2160 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.007 s
0.20/0.50	# System time              : 0.006 s
0.20/0.50	# Total time               : 0.013 s
0.20/0.50	# Maximum resident set size: 1772 pages
0.20/0.50	% E---3.1 exiting
0.20/0.50	% E exiting
0.20/0.50	EOF